A "dual-tree" scheme for fault-tolerant multicast
نویسندگان
چکیده
To protect against possible network node or link failure, pre-planned failure recovery schemes are necessary to achieve higher reliability of communications. A couple of schemes have been previously reported for multicast. In this paper, we present a scheme based on a “dual-tree” structure in which a secondary tree for fault-tolerance purpose is built as a complement to the primary multicast tree. The secondary tree provides alternative delivery paths that can be activated when link or node failure is detected in the primary multicast tree. Simulation experiments show that this scheme has shorter restoration time and cause less multicast tree cost increase after restoration than some schemes proposed previously.
منابع مشابه
An Integrated Approach to Efficiently Providing Fault Tolerance for Mobile Multicast
The paper presents an efficient approach to providing fault-tolerant capability for mobile multicast. In multicast communication, packets can be concurrently sent from a source node to all members by a multicast tree. If failures occur in nodes (links) of the multicast tree, the faulty tree will be partitioned into several disconnected subtrees. For the subtrees without the source node, it cann...
متن کاملAn Efficient Multicast Protection Scheme Based on a Dual-forest Mohand Yazid Saidi , Bernard Cousin and Miklos Molnar
To provide fault-tolerance for multicast connections, different techniques of protection are developed. These techniques can be classed into reactive and pro-active approaches. Reactive approaches can have long recovery latency which is undesirable for many types of applications such as the real time ones. In this paper, we focus on the multicast pro-active fault-tolerance schemes. One of the p...
متن کاملTree-Based Fault-Tolerant Multicast in Multicomputer Networks Using Pipelined Circuit Switching
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links without requiring nodes to have global fault information. The multicast algorithm is provably deadloc...
متن کاملTree-Based Fault-Tolerant Multicast in Multicomputer Networks
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces signific...
متن کاملSupport Efficient and Fault-Tolerant Multicast in Bufferless Network-on-Chip
In this paper, we propose three Deflection-Routing-based Multicast (DRM) schemes for a bufferless NoC. The DRM scheme without packets replication (DRM noPR) sends multicast packet through a nondeterministic path. The DRM schemes with adaptive packets replication (DRM PR src and DRM PR all) replicate multicast packets at the source or intermediate node according to the destination position and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001